Concurrency Control in R-trees

نویسنده

  • S. Mehrotra
چکیده

The nature and types of information in a dynamic battle eld environment ranges from georeferenced satellite images and terrain elevation to maps containing terrain features like roads, enemy unit deployment, activities and targets to spatio-temporal objects like logistic, tactical, and collection management plans. E cient processing of queries over such objects in a database requires support of access paths using an e ective multidimensional data structure. While a large body of research exists on multidimensional data structures (grid les, R-trees, hB-trees to name a few), none of them have been fully integrated into any commercial-strength database management system. One of the primary reasons is the lack of e ective techniques to support concurrent access and manipulations to data using these data structures. This paper identi es problems in supporting concurrent operations over multidimensional data structures and sketches solutions in the context of R-trees. R-tree is a popular multidimensional data structure that has been incorporated into Illustra data management system and has also been implemented as part of the Shore object management system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of majority protocol for controlling transactions concurrency in distributed databases by multi-agent systems

In this paper, we propose a new concurrency control algorithm based on multi-agent systems which is an extension of majority protocol. Then, we suggest a clustering approach to get better results in reliability, decreasing message passing and algorithm’s runtime. Here, we consider n different transactions working on non-conflict data items. Considering execution efficiency of some different...

متن کامل

A Survey of Concurrency Control Algorithms in the Operating Systems

Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...

متن کامل

Performance Evaluation of Main-Memory R-tree Variants

There have been several techniques proposed for improving the performance of main-memory spatial indexes, but there has not been a comparative study of their performance. In this paper we compare the performance of six main-memory R-tree variants: R-tree, R*-tree, Hilbert R-tree, CR-tree, CR*tree, and Hilbert CR-tree. CR*-trees and Hilbert CR-trees are respectively a natural extension of R*-tre...

متن کامل

PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors

Concurrency control on B trees is primarily achieved with latches, but serialization and contention can hinder scalability. As core counts on current processors increase, it is imperative to develop scalable latch-free techniques for concurrency control. We present PALM, a novel technique for performing multiple concurrent queries on in-memory B trees. PALM is based on the Bulk Synchronous Para...

متن کامل

Combinational Approach for Object Clipping Using GLIP and Protection Against Sql Injection Attacks

Multidimensional databases are being used in a wide range of applications. To meet this fast-growing demand,R+ trees were used that exhibit outstanding search performance. In order to support efficient concurrent access in multiuser environments, concurrency control mechanisms for multidimensional indexing have been proposed. However, these mechanisms cannot be directly applied to the R+-tree b...

متن کامل

A Survey of Concurrency Control Algorithms in the Operating Systems

Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997